M EMORAX, a precise and sound tool for automatic fence insertion under TSO ? Parosh Aziz Abdulla1 , Mohamed Faouzi Atig1 , Yu-Fang Chen2 , Carl Leonardsson1 , and Ahmed Rezine3 1

Source URL: user.it.uu.se

• Theoretical computer science
• Mathematics
• Finite automata
• Computing
• Theory of computation
• Formal methods
• Reachability problem
• Logic in computer science
• Model checking
• Memory barrier
• Preorder
• Algorithm

COMP 520 FallScanners and Parsers (1) Scanners and parsers

Source URL: www.sable.mcgill.ca

• Software
• Computing
• Compiling tools
• Formal languages
• Finite automata
• Parser generators
• Compiler construction
• Flex
• Printf format string
• Lexical analysis
• GNU bison
• Regular expression

Space-Efficient Data Structures for Top-k Completion Bo-June (Paul) Hsu Giuseppe Ottaviano Microsoft Research

Source URL: www2013.wwwconference.org

• Computer programming
• Software engineering
• Computing
• Search algorithms
• Finite automata
• Trie
• Radix tree
• Binary trees
• Arrays
• Routing algorithms
• Suffix tree
• Tree

JFP): 218–283, c Cambridge University Press 2014 ⃝ 218

Source URL: ilyasergey.net

• Models of computation
• Formal languages
• Pushdown automaton
• Finite automata
• Nondeterministic finite automaton
• Computability
• Abstract interpretation
• Context-free language
• Symbol
• Nested stack automaton
• Tree stack automaton

Model Checking of Finite-state Machine-based Scenario-aware Dataflow Using Timed Automata Mladen Skelin Department of Engineering Cybernetics, Norwegian University of Science and Technology

Source URL: people.cs.aau.dk

OpenNWA: A Nested-Word Automaton Library⋆ Evan Driscoll1 , Aditya Thakur1 , and Thomas Reps1,2 1 Computer Sciences Department, University of Wisconsin – Madison {driscoll,adi,reps}@cs.wisc.edu

Source URL: research.cs.wisc.edu

• Formal languages
• Finite automata
• Nested word
• Words
• Finite-state machine

CS–172 Computability & Complexity, FallMinimizing Finite Automata Given a DFA M , can we find an equivalent DFA (i.e., one that recognizes the same language as M ) with the minimum possible number of states? Thi

Source URL: www-inst.eecs.berkeley.edu

A CHARACTERIZATION OF p-AUTOMATIC SEQUENCES AS COLUMNS OF LINEAR CELLULAR AUTOMATA ERIC ROWLAND AND REEM YASSAWI Abstract. We show that a sequence over a finite field Fq of characteristic p is p-automatic if and only if

Source URL: thales.math.uqam.ca

Journal of Automata, Languages and Combinatorics, 97–115 c Otto-von-Guericke-Universit¨ at Magdeburg TWO-WAY FINITE AUTOMATA

Source URL: lambda-diode.com

Secure Outsourcing of DNA Searching via Finite Automata Marina Blanton and Mehrdad Aliasgari Department of Computer Science and Engineering, University of Notre Dame, {mblanton,maliasga}@cse.nd.edu

Source URL: www.cse.nd.edu